class STACK{T} < $STACK{T} |
---|
**** | NR:
-NR: class NR_STACK{T} < $NR_STACK{T} is include NR_A_STACK{T} end;
----------------------------------------------------------------- |
$STACK{_} | $REENTRANT | $NR_STACK{_} | $DISPENSER{_} | $STR | $CONTAINER{_} | $ELT{_} | $ELT | A_STACK{_} |
copy: SAME |
---|
**** | e ~void(self) is --NR: NR: copy: SAME pre ~void(self) is |
create(e: $ELT{T}): SAME |
---|
**** | Push the elements of "e" onto the stack. If "e" is an ordered collection this will push elements such that the last element is left at the top of the stack |
create: SAME |
---|
create_capacity(n: INT): SAME |
---|
**** | Preallocate n empty elements |
create_from(a: ARRAY{T}): SAME |
---|
current: T |
---|
has(e: T): BOOL |
---|
is_empty: BOOL |
---|
pop: T |
---|
push(e: T) |
---|
remove:T |
---|
size: INT |
---|
str: STR |
---|
top: T |
---|
**** | Return the top element of the stack |
elt!: T |
---|
reverse_elt!: T |
---|
**** | Yield the elements of the stack in reverse order i.e. ending with "top". |
top!: T |
---|
**** | Same as elt! |
attr s: FLIST{T}; |
---|
attr s: FLIST{T}; |
---|